The equivalence between costly and probabilistic voting models

نویسندگان

  • Yuichiro Kamada
  • Fuhito Kojima
چکیده

In costly voting models, voters abstain when a stochastic cost of voting exceeds the benefit from voting. In probabilistic voting models, they always vote for a candidate who generates the highest utility, which is subject to random shocks. We prove an equivalence result: In two-candidate elections, given any costly voting model, there exists a probabilistic voting model that generates winning probabilities identical to those in the former model for any policy announcements, and vice versa. Thus many predictions of interest established in one of the models hold in the other as well, providing robustness of the conclusions to model specifications. ∗Kamada: Cowles Foundation for Research in Economics, Yale University, New Haven, CT 06511, and Haas School of Business, University of California, Berkeley, Berkeley, CA 94720, e-mail: [email protected]. Kojima: Department of Economics, Stanford University, Stanford, CA 94305, e-mail: [email protected]. We are grateful to Attila Ambrus, John William Hatfield, Matt Jackson, Martin Osborne, Yuki Takagi, and an anonymous referee. Bobak Pakzad-Hurson and Fanqi Shi provided excellent research assistance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Effective and Optimal Fusion Rule in the Presence of Probabilistic Spectrum Sensing Data Falsification Attack

Cognitive radio (CR) network is an excellent solution to the spectrum scarcity problem. Cooperative spectrum sensing (CSS) has been widely used to precisely detect of primary user (PU) signals. The trustworthiness of the CSS is vulnerable to spectrum sensing data falsification (SSDF) attack. In an SSDF attack, some malicious users intentionally report wrong sensing results to cheat the fusion c...

متن کامل

Local equilibrium equivalence in probabilistic voting models

Electoral equilibria depend upon candidates’ motivations. Maximization of expected vote share may not lead to the same behavior as maximization of the probability of winning the election. Accordingly, it is desirable to understand when electoral equilibria are insensitive to the choice of candidate motivations. This paper examines sufficient conditions for local equilibrium equivalence between ...

متن کامل

Voting and different ranking orders in DEA

Data Envelopment Analysis (DEA) technique now widely use for efficiency evaluation of a set of Decision Making Units (DMUs). As regards of the necessity for ranking efficient units different DEA models presented each of which has advantages and rank efficient units from special aspects. Note that all the existing ranking models have disadvantages, as well and there is not a model in which all t...

متن کامل

A ‎N‎ew Voting Model For Groups With Members of Unequal Power and Proficiency‎

To proposing a voting model for groups with members of unequal power and proficiency, we present some models for rank ordering efficient candidates, by extending the ideas of some authors. Then, we propose a new methodology to rank the ranking models for the performance indices of only DEA efficient candidates based on a classical voting model. Also, an approach for combining the results obtain...

متن کامل

Probabilistic Voting in the Spatial Model of Elections: The Theory of Office-motivated Candidates

We unify and extend much of the literature on probabilistic voting in two-candidate elections. We give existence results for mixed and pure strategy equilibria of the electoral game. We prove general results on optimality of pure strategy equilibria vis-a-vis a weighted utilitarian social welfare function, and we derive the well-known “mean voter” result as a special case. We establish broad co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Games and Economic Behavior

دوره 80  شماره 

صفحات  -

تاریخ انتشار 2013